On the Complexity of Conditional Logics
نویسندگان
چکیده
Conditional logics, introduced by Lewis and Stalnaker, have been utilized in artiicial intelligence to capture a broad range of phenomena. In this paper we examine the complexity of several variants discussed in the literature. We show that, in general, deciding satis-ability is PSPACE-complete for formulas with arbitrary conditional nesting and NP-complete for formulas with bounded nesting of conditionals. However, we provide several exceptions to this rule. Of particular note are results showing that (a) when assuming uniformity (i.e., that all worlds agree on what worlds are possible), the decision problem becomes EXPTIME-complete even for formulas with bounded nesting, and (b) when assuming absoluteness (i.e., that all worlds agree on all conditional statements), the decision problem is NP-complete for formulas with arbitrary nesting .
منابع مشابه
It Takes Two to Tango: Customization and Standardization as Colluding Logics in Healthcare; Comment on “(Re) Making the Procrustean Bed Standardization and Customization as Competing Logics in Healthcare”
The healthcare context is characterized with new developments, technologies, ideas and expectations that are continually reshaping the frontline of care delivery. Mannion and Exworthy identify two key factors driving this complexity, ‘standardization’ and ‘customization,’ and their apparent resulting paradox to be negotiated by healthcare professionals, managers and policy makers. However, whil...
متن کاملGeneric Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional lo...
متن کاملTableau-Based Theorem Proving In Normal Conditional Logics
This paper presents an extension of the semantic tableaux approach to theorem proving for the class of normal conditional logics. These logics are based on a possible worlds semantics, but contain a binary “variable conditional” operator =E= instead of the usual operator for necessity. The truth of A +B depends both on the accessibility relation between worlds, and on the proposition expressed ...
متن کاملFutures studies of hospital resilience supply chain with the intuitive logics scenario planning
Background: Scenario planning is one of the most crucial future study methods in uncertain and complex situations. Hospital supply chain resilience also requires an understanding of future events due to the complexity of relationships and exposure to unexpected circumstances. The purpose of this study is to formulate scenarios for the future development of hospital supply chain resilience. Mat...
متن کاملComputational Complexity of Input/Output Logic
Input/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P .
متن کامل